On a Pair of Dual Subschemes of the Hamming Scheme Hn(q)
نویسندگان
چکیده
We consider codes in the Hamming association scheme Hn (q) with interesting metric properties. We describe how a uniformly packed linear code C determines a pair of dual subschemes. The existence of this pair of sub schemes is used to establish restrictions on the possible distances between codewords in the dual code C.L. These restrictions also apply to arbitrary codes with degree e + 1 and strength 2e or 2e + 1. An analogous result gives necessary conditions for the existence of non-linear uniformly packed codes. When q = 2 we determine the possible parameters of uniformly packed 2-error-correcting linear codes.
منابع مشابه
Hamming Graph in Nomura Algebra
Let A be an association scheme on q ≥ 3 vertices. We show that the Bose-Mesner algebra of the generalized Hamming scheme H(n,A), for n ≥ 2, is not the Nomura algebra of a type II matrix. This result gives examples of formally self-dual Bose-Mesner algebras that are not the Nomura algebras of type II matrices.
متن کاملAssociation Schemes of Quadratic Forms and Symmetric Bilinear Forms
Let Xn and Yn be the sets of quadratic forms and symmetric bilinear forms on an n-dimensional vector space V over Fq , respectively. The orbits of GLn(Fq ) on Xn × Xn define an association scheme Qua(n, q). The orbits of GLn(Fq ) on Yn × Yn also define an association scheme Sym(n, q). Our main results are: Qua(n, q) and Sym(n, q) are formally dual. When q is odd, Qua(n, q) and Sym(n, q) are iso...
متن کاملDisconnected Vertex Sets and Equidistant Code Pairs
Two disjoint subsets A and B of a vertex set V of a finite graph G are called disconnected if there is no edge between A and B. If V is the set of words of length n over an alphabet {1, . . . , q} and if two words are adjacent whenever their Hamming distance is not equal to a fixed δ ∈ {1, . . . , n}, then a pair of disconnected sets becomes an equidistant code pair. For disconnected sets A and...
متن کاملA Novel Technique for Steganography Method Based on Improved Genetic Algorithm Optimization in Spatial Domain
This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...
متن کاملSelf-Dual Codes over Z_2xZ_4
Self-dual codes over Z2 ×Z4 are subgroups of Z2 ×Zβ4 that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each type, the possible values α, β such that there exist a code C ⊆ Z 2 ×Z 4 are established. Moreover, the construction of a Z2Z4-linear code for each type and possible pair (α, β) is given. Fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 6 شماره
صفحات -
تاریخ انتشار 1985